منابع مشابه
Brushing without capacity restrictions
In graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. Various problems arise, such as determining the minimum number of brushes that are required to clean the entire graph. This number is called the brushing number. Here, we study a new variant of the brushing problem in which one vertex is cleaned at a time, but more than one brush may traverse a dirty ed...
متن کاملBrushing with additional cleaning restrictions
In graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the en...
متن کاملOn Coding Without Restrictions
Many coded modulation constructions, such as lattice codes, are visualized as restricted subsets of an infinite cmstellation (IC) of points in the n-dimensional Euclidean space. We shall regard an IC as a code without restrictions employed for the AWGN channel. For an IC the concept of coding rate is meaningless and we shall use, instead of coding rate, the normalized logarithmic density (NLD)....
متن کاملFunctional Boundary Value Problems without Growth Restrictions
Let J = [O,TJ and F : C°(J) x C°(J) x lH'.--7 Ll(J) be an operator. Existence theorems for the functional differential equation (g(x'(t)))' = (F(x,x',x'(t)))(t) with functional boundary conditions generalizing the non-homogeneous Dirichlet boundary conditions and nonhomogeneous mixed boundary conditions are given. Existence results are proved by the Leray-Schauder degree theory under some sign ...
متن کاملModeling in OWL 2 without Restrictions
The Semantic Web ontology language OWL 2 DL comes with a variety of language features that enable sophisticated and practically useful modeling. However, the use of these features has been severely restricted in order to retain decidability of the language. For example, OWL 2 DL does not allow a property to be both transitive and asymmetric, which would be desirable, e.g., for representing an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.01.024